Structure and Computation of Straight Skeletons in 3-Space
نویسندگان
چکیده
We characterize the self-parallel (mitered) offsets of a general nonconvex polytope Q in 3-space and give a canonical algorithm that constructs a straight skeleton for Q.
منابع مشابه
Three-dimensional Straight Skeletons from Bisector Graphs
A straight skeleton of a polygon or of a polytope is a piecewise linear skeletal structure that partitions the underlying object by means of a self-parallel shrinking process. We propose a method for constructing different straight skeletons for a given nonconvex polytope Q in 3-space. The approach is based on so-called bisector graphs on the sphere, and allows for generating straight skeletons...
متن کاملStraight Skeletons of Monotone Polygons
We study the characteristics of straight skeletons of strictly monotone polygonal chains, and use them to devise an algorithm for computing positively weighted straight skeletons of strictly monotone polygons. Our algorithm runs in O(n log n) time and O(n) space.
متن کاملComputing Mitered Offset Curves Based on Straight Skeletons
We study the practical computation of mitered and beveled offset curves of planar straight-line graphs (PSLGs), i.e., of arbitrary collections of straight-line segments in the plane that do not intersect except possibly at common end points. The line segments can, but need not, form polygons. Similar to Voronoi-based offsetting, we propose to compute a straight skeleton of the input PSLG as a p...
متن کاملDistance functions and skeletal representations of rigid and non-rigid planar shapes
Shape skeletons are fundamental concepts for describing the shape of geometric objects, and have found a variety of applications in a number of areas where geometry plays an important role. Two types of skeletons commonly used in geometric computations are the straight skeleton of a (linear) polygon, and the medial axis of a bounded set of points in the k-dimensional Euclidean space. However, e...
متن کاملStraight Skeletons for General Polygonal
A novel type of skeleton for general polygonal gures, the straight skeleton S(G) of a planar straight line graph G, is introduced and discussed. Exact bounds on the size of S(G) are derived. The straight line structure of S(G) and its lower combinatorial complexity may make S(G) preferable to the widely used Voronoi diagram (or medial axis) of G in several applications. We explain why S(G) has ...
متن کامل